undirected graph
英 [ˌʌndɪˈrɛktɪd ɡræf]
美 [ʌndəˈrɛktəd ɡræf]
无向图
双语例句
- Undirected graph dot language-syntax generation
无向图dot语言语法生成 - The characteristic of MVP is the conversion from netlist to weighted undirected graph and its objective is to improve the efficiency of VLSI partitioner by avoiding partitioning netlist directly.
MVP系统特点体现在VLSI线网到无向赋权图的转换，避免了剖分算法直接在VLSI线网上进行剖分，提高了VLSI剖分的效率。 - A circ is an undirected graph having only vertices of even nonzero degree.
一广义圈是一无向图，其顶点次数都是非零偶数。 - Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph ( A).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通（A）。 - Techniques by compound branch and network ripping to find out all spanning trees of an undirected graph
寻找无向图中全部生成树的复合支路和网络撕裂技术 - On the basis of topology discovery, a probabilistic topology failure localization method based on undirected graph to recover IP network from failure is put forward, which is useful in repairing network failure.
在研究IP网络拓扑发现的基础上，提出了一种基于无向图的网络拓扑概率故障定位方法，能够有效地排除网络故障、提高网络性能并增强网络的可靠性。 - In this paper we present an approximation algorithm for ( k, m) optimal partition problem on an undirected graph. We show that this approximation algorithm which produces a near optimal solution runs in polynomial time.
本文提出了无向图（k，m）最优划分的一个近似算法，证明了这是一个产生近似最优解的多项式时间算法。 - A method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.
提出了一种基于图结构描述的二维图形尺寸标注模型的建立及存储方法。 - Let G be a simple undirected graph and C be the complement of C.
设G是一个简单无向图，酉麦示G的补图。 - A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph
枚举一个无向图所有最小割集的一种简单算法 - Let G be a finite, simple and undirected graph.
设G是有限简单无向图。 - Based on the theory of the minimum spanning tree using undirected graph, the optimum plane layout of the sewerage pipeline network system was studied with the consideration of the effect of the weight changing on the spanning tree.
根据最小生成树理论，考虑网络权值变化对生成树的影响，采用无向图对排水管网系统平面布置优化设计方法进行了研究。 - In this paper, the concept of the characteristic polynomial of the undirected graph is defined, and the formulae for the number of loops, edges and triangles are represented by the coefficients of a characteristic polynomial.
本文引入无向图的特征多项式的概念，并推导出由特征多项式的系数表示的无向线图中圈的个数、边的条数及简单图中三角形的个数的计算公式。 - Research on Subgraphs of a Connected Undirected Graph of Which Vertices May Have the Same Names
结点可同名的连通无向图的子图研究 - In term of the literature 1 a new algorithm for finding all undirected Hamiltonian circuits in an undirected graph is presented in this paper.
本文在文献的基础之上，证明了一种可求得无向图中全部哈密顿回路的新算法。 - Conditional Random Fields ( CRFs), a recently introduced conditioned probabilistic model for labeling and segmenting sequential data, is a undirected graph model that calculate the conditional probability over output nodes given the input nodes.
条件随机场是近年来提出的，用于标记和分割序列数据的条件概率模型，也是在给定输入节点条件下计算输出节点的条件概率的无向图模型。 - Wireless sensor network could be described as an undirected graph.
无线传感器网络可以用无向图表示，节点及其一跳邻节点构成一个子图。 - The algorithm can list all k arbitrary k trees of a directed or undirected graph. It can be used in topological analysis of active or passive networks and any other situations which all k trees are needed to be found out.
提出了生成全部K树的MINTY-DFS算法，该算法能够生成一个有向图或无向图的全部任意K树，可应用于有源网络或无源网络的拓扑分析以及其它要求K树的场合。 - Broadcast networks can be expressed by a simple connected undirected graph.
将广播网络用简单连通的无向图表示。 - The paper, puts forward that the path set method based on directed graph cant not be used to determine total diagonal structure in a network, a route set method based on undirected graph to determine the total diagonal branch structure in a network.
文章论述了基于有向图的通路法集合算法不能够确定网络的全部角联结构，提出了确定网络全部角联结构的基于无向图的路径集合算法。 - Firstly, the undirected graph model in product structure domain, the directed graph model in product function domain, and the vector table model in customer requirement domain were constructed.
分别构建了产品结构域无向图模型、功能域有向图模型和需求域向量表模型。 - Then it studies a topology failure location method based on undirected graph to recover IP network from failure.
并在此基础上，研究了一种基于无向图的拓扑故障定位方法，为IP网络的故障排除提供了有力依据。 - An Algorithm of Seeking Maximum Clique in Any Undirected Graph and Its Computer Programming
寻求任意无向图的最大团集的一个算法及其程序 - In the proposed method, an undirected graph is used to represent candidate relationships between vias and redundant vias, and conflict relationships between redundant vias due to design rule violations.
首先建立一个用于表示通孔和冗余通孔之间的候选关系的无向图，这个无向图也能用于表示违反了设计规则的冗余孔之间的冲突关系。 - First, we study the static consensus problem of gossip algorithms for complex multi-agent systems with quantization information communication in undirected graph.
首先，在无向图的基础上研究了基于量化信息通信的复杂多个体系统的流言算法静态一致性问题。 - The algorithm firstly distills vision and structure information from a web page to construct a weighted undirected graph, whose vertices are the leaf nodes of the DOM tree and the edges represent the visible position relationship between vertices.
该算法首先将抽取网页结构和视觉信息构造一个无向加权图，其中图的顶点是网页DOM树中的可视叶子节点，图的边为浏览器中显示的节点位置关系。 - Given a weighted undirected graph, the vertex set is partitioned into several clusters.
给定一个完全无向图，其顶点集被划分成若干个子集。 - The problem of identifying minimum spanning tree ( MST) of a connected, undirected graph is a classical network optimization problem which can be solved efficiently in polynomial time by Kruskal algorithm and Prim algorithm.
最小生成树问题是一个经典的网络优化问题，目前已有高效的算法在多项式时间内对其进行求解，比如Prim算法与Kruskal算法。 - The signal in system is transmitted by the undirected graph which is abstracted from experiment circuit diagram.
根据实验电路图抽象出信号传播无向图，建立系统的信号传播机制。 - Because the number of feature in this specific region is not very large, we use an undirected graph to represent the constraint system and give the definition of the method as well as the detailed steps.
因为在一个模型的特定区域内的特征数量不是很多，我们使用了无向图来表示特征模型约束系统，并给出该方法的定义以及详细的步骤。